Polynomial-time algorithms for generation of prime implicants
نویسندگان
چکیده
منابع مشابه
Models and Algorithms for Computing Minimum-Size Prime Implicants
Minimum-size prime implicants of Boolean functions find application in many areas of Computer Science including, among others, Electronic Design Automation and Artificial Intelligence. The main purpose of this paper is to describe and evaluate two fundamentally different modeling and algorithmic solutions for the computation of minimum-size prime implicants. One is based on explicit search meth...
متن کاملEvaluate Prime Implicants Description
data.logicfs Example Data of logicFS Description data.logicfs contains two objects: a simulated matrix data.logicfs of 400 observations (rows) and 15 variables (columns) and a vector cl.logicfs of length 400 containing the class labels of the observations. Each variable is categorical with realizations 1, 2 and 3. The first 200 observations are cases, the remaining are controls. If one of the f...
متن کاملPrime Implicants and Belief Update
Adaptation is one of the most important capabilities that an intelligent agent should present. In order to provide this capability to logical-based agents, the Belief Change area proposes methods to incorporate new information in a belief set. Properties like consistency and minimal change guide the change process. The notion of minimal change is usually associated with a closeness criterion ba...
متن کاملWidening ROBDDs with Prime Implicants
Despite the ubiquity of ROBDDs in program analysis, and extensive literature on ROBDD minimisation, there is a dearth of work on approximating ROBDDs. The need for approximation arises because many ROBDD operations result in an ROBDD whose size is quadratic in the size of the inputs. Furthermore, if ROBDDs are used in abstract interpretation, the running time of the analysis is related not only...
متن کاملTuning classification for prime implicants based learner
This paper considers an algorithm for learning from examples from the viewpoint of validation and improving classification accuracy. The examined algorithm represents the sets of positive and negative training instances as logical function in sum-of-minterms form and finds this functions prime implicants. After choosing suitable validation scheme the goal is to investigate in improving classifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1992
ISSN: 0885-064X
DOI: 10.1016/0885-064x(92)90033-8